Relative Truth Degree of Logic Formulas and Graded Fuzzy Logic
نویسنده
چکیده
The concept of logic proposition induced functions is proposed in the present paper, then the concept of relative truth degree of propositions with respect to a logic theory Γ is introduced by means of infinite product of evenly distributed probability spaces and integrated semantics respectively w.r.t. discrete and continuous situations, and a graded approximate reasoning theory is established. Next, theory of consistency degrees of finite logic theories is also proposed. Finally, the simple application of graded fuzzy logic in fuzzy inference is given by examples.
منابع مشابه
Fuzzy Propositional Formulas under the Stable Model Semantics
We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax of fuzzy propositional logic, but its semantics distinguishes stable models from non-stable models. The generality of the language allows for highly configura...
متن کاملFuzzy Horn logic I
The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theori...
متن کاملRational fuzzy attribute logic
We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka style and depending on the choice of structure of truth degrees, the logic is a decidable fragment of the Rational Pavelka logic (RPL) or the Rational Product...
متن کاملSTRATIFIED OPERATORS AND GRADED CONSEQUENCE RELATIONS by
1. GRADED DEDUCTIVE TOOLS FOR GRADED INFORMATION In accordance with Tarski’s point of view, we identify a crisp deductive apparatus with a “deduction operator”, i.e. a closure operator D : P(Å)→ P(Å) where Å is the set of formulas in a logic. Given a set X of formulas, we interpret D(X) as the set of logical consequences of X. Now, we can imagine a "stratified" deduction apparatus, i.e. the ava...
متن کاملFuzzy attribute logic over complete residuated lattices
We present a logic, called fuzzy attribute logic, for reasoning about formulas describing particular attribute dependencies. The formulas are of a form A ⇒ B where A and B are collections of attributes. Our formulas can be interpreted in two ways. First, in data tables with entries containing degrees to which objects (table rows) have attributes (table columns). Second, in database tables where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer and Information Science
دوره 2 شماره
صفحات -
تاریخ انتشار 2009